A Minimal Volume Ellipsoid around a Simplex
نویسنده
چکیده
This paper presents a complete proof of the fact 1 that the ellipsoid with minimal volume containing the regular simplex is a sphere (lemma 4). It is shown also that the proof can be used to build and compute easily minimal volume ellipsoids around irregular simplex (Theorem 1). Some consequences are presented. The first two lemmas deal with the wellknown (see [2],[3]) Steiner and Swarz symmetry mappings applied to ellipsoids. Let R be the p-dimensional euclidean space.
منابع مشابه
Applications to Subset Selection for MVE Estimator and Multiclass Discrimination
The MVE estimator is an important estimator in robust statistics and characterized by an ellipsoid which contains inside 100β percent of given points in IR n and attains the minimal volume, where β ∈ [0.5, 1.0) is of usual interest. The associated minimal ellipsoid can be considered as a generalization of the minimum volume covering ellipsoid which covers all the given points since the latter e...
متن کاملA modification of the ellipsoid method
We consider convex quadratic programming problem with convex quadratic constraints and suggest a modification of the well-known ellipsoid method based on using an ellipsoidal layer in the problem of circumscribing the minimum volume ellipsoid around of a part of a given ellipsoid. Our paper contains further development and improvement of the technique previously developed in [E.G88]. We show ho...
متن کاملLinear Programming and Integer Linear Programming
5 Algorithms 8 5.1 Fourier-Motzkin Elimination . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 5.2 The Simplex Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 5.3 Seidel’s Randomized Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . 9 5.4 The Ellipsoid Method . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 5.5 Using the Ellipsoid...
متن کاملLinear Programming
This paper is a short didactical introduction to Linear Programming (LP). The main topics are: formulations, notes in convex analysis, geometry of LP, simplex method, duality, ellipsoid algorithm, interior point methods.
متن کاملLectures 8 ( part ) , 9 and 10 ( part )
The Ellipsoid algorithm was developed by (formerly) Soviet mathematicians (Shor (1970), Yudin and Nemirovskii (1975)). Khachian (1979) proved that it provides a polynomial time algorithm for linear programming. The average behavior of the Ellipsoid algorithm is too slow, making it not competitive with the simplex algorithm. However, the theoretical implications of the algorithm are very importa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003